Approximation Algorithms for Scheduling Parallel Jobs with More Machines
نویسندگان
چکیده
منابع مشابه
Approximation algorithms for scheduling parallel machines with capacity constraints ∗
In this paper, we consider the classical scheduling problem on parallel machines with capacity constraints. We are given m identical machines, where each machine k can process up to ck jobs. The goal is to assign the n ≤ ∑m k=1 ck independent jobs on the machines subject to the capacity constraints such that the makespan is minimized. This problem is a generalization of the c-partition problem ...
متن کاملImproved approximation algorithms for scheduling parallel jobs on identical clusters
The Multiple Cluster Scheduling Problem corresponds to minimize the maximum completion time (makespan) of a set of n parallel rigid (and non-preemptive) jobs submitted to N identical clusters. It cannot be approximated with a ratio better than 2 (unless P = NP). We present in this paper the methodology that encompasses several existing results [1, 2]. We detail first how to apply it for obtaini...
متن کاملSolving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کاملSolving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کاملScheduling unrelated parallel machines with optional machines and jobs selection
In this paper we study two generalizations of the well known unrelated parallel machines scheduling problem under makespan (Cmax) minimization. First, a situation in which not every available parallel machine should be used and it is desirable to employ only a subset of the parallel machines. This is referred to as “Not all Machines” or NAM in short. This environment applies frequently in produ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of information and communication convergence engineering
سال: 2011
ISSN: 2234-8255
DOI: 10.6109/jicce.2011.9.4.471